Human motion database with a binary tree and node transition graphs
نویسندگان
چکیده
Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extracting human motion data and demonstrate that the database can be applied to the recognition and motion synthesis problems in robotics. We develop an efficient method for building a human motion database from a collection of continuous, multidimensional motion clips. The database consists of a binary tree representing the hierarchical clustering of the states observed in the motion clips, as well as node transition graphs representing the possible transitions among the nodes in the binary tree. Using databases constructed from real human motion data, we demonstrate that the proposed data structure can be used for human motion recognition, state estimation and prediction, and robot motion planning.
منابع مشابه
A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملModelling of Eyeball with Pan/Tilt Mechanism and Intelligent Face Recognition Using Local Binary Pattern Operator
This paper describes the vision system for a humanoid robot, which includes the mechanism that controls eyeball orientation and blinking process. Along with the mechanism designed, the orientation of the camera, integrated with controlling servomotors. This vision system is a bio-mimic, which is designed to match the size of human eye. This prototype runs face recognition and identifies, match...
متن کاملIncidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملAutomatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Auton. Robots
دوره 30 شماره
صفحات -
تاریخ انتشار 2009